Linear spaces of real matrices of constant rank
نویسندگان
چکیده
منابع مشابه
On Linear Spaces of Skew-symmetric Matrices of Constant Rank
Linear sections of the Grassmannians G(1, n) of lines in P appear naturally in several different situations. In complex projective algebraic geometry, 3-dimensional linear sections of G(1, 4) appear in the classification of Fano threefolds, 2-dimensional linear sections of G(1, 5) define one of the smooth scrolls of P. Linear sections of dimension n − 1 of the Grassmannian of lines of P are cla...
متن کاملPrimitive Spaces of Matrices of Bounded Rank
A weak canonical form is derived for vector spaces of m x n matrices all of rank at most r. This shows that the structure of such spaces is controlled by the structure of an associated 'primitive' space. In the case of primitive spaces it is shown that m and n are bounded by functions of r and that these bounds are tight. 1980 Mathematics subject classification (Amer. Math. Soc.): 15 A 30, 15 A...
متن کاملVector Spaces of Matrices of Low Rank
In this paper we study vector spaces of matrices, all of whose elements have rank at most a given number. The problem of classifying such spaces is roughly equivalent to the problem of classifying certain torsion-free sheaves on projective spaces. We solve this problem in case the sheaf in question has first Chern class equal to 1; the characterization of the vector spaces of matrices of rank d...
متن کاملSpaces of Matrices of Bounded Rank
IN this paper we shall consider matrices over a field F and shall prove the following result: THEOREM. Let M be a 2-dimensional space o/mxn matrices with the property that rank (X) *£ k < \F\ for every XeM. Then there exist two integers r, s, O^r, s *£ fc with r + s = k, and two non-singular matrices P, Q such that, for all XeM, PXQ has the form Notice that a matrix of the above form necessaril...
متن کاملReal root finding for low rank linear matrices
The problem of finding low rank m × m matrices in a real affine subspace of dimension n has many applications in information and systems theory, where low rank is synonymous of structure and parcimony. We design a symbolic computation algorithm to solve this problem efficiently, exactly and rigorously: the input are the rational coefficients of the matrices spanning the affine subspace as well ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1993
ISSN: 0024-3795
DOI: 10.1016/0024-3795(93)90257-o